The generalized triangular decomposition
نویسندگان
چکیده
Given a complex matrix H, we consider the decomposition H = QRP∗, where R is upper triangular and Q and P have orthonormal columns. Special instances of this decomposition include the singular value decomposition (SVD) and the Schur decomposition where R is an upper triangular matrix with the eigenvalues of H on the diagonal. We show that any diagonal for R can be achieved that satisfies Weyl’s multiplicative majorization conditions:
منابع مشابه
Technical Note - Generalized Upper Bounds and Triangular Decomposition in the Simplex Method
متن کامل
Matrix Decomposition of the Unified Generalized Stirling Numbers and Inversion of the Generalized Factorial Matrices
In this paper, we give a matrix decomposition method used to calculate unified generalized Stirling numbers in an explicit, non-recursive mode, and some of its applications. Then, we define generalized factorial matrices which may be regarded as a generalization in the form of the Vandermonde matrices, and presents some of their properties — in particular, triangular matrix factors of the inver...
متن کاملDECOMPOSITION METHOD FOR SOLVING FULLY FUZZY LINEAR SYSTEMS
In this paper, we investigate the existence of a positive solution of fully fuzzy linear equation systems. This paper mainly to discuss a new decomposition of a nonsingular fuzzy matrix, the symmetric times triangular (ST) decomposition. By this decomposition, every nonsingular fuzzy matrix can be represented as a product of a fuzzy symmetric matrix S and a fuzzy triangular matrix T.
متن کاملComputing the Generalized Singular Value Decomposition
We present a variation of Paige's algorithm for computing the generalized singular value decomposition (GSVD) of two matrices A and B. There are two innovations. The rst is a new preprocessing step which reduces A and B to upper triangular forms satisfying certain rank conditions. The second is a new 2 by 2 triangular GSVD algorithm, which constitutes the inner loop of Paige's algorithm. We pre...
متن کاملGeneralized Inverse of Block Intuitionistic Fuzzy Matrices
In this paper we define multiplication between intuitionistic fuzzy matrices (IFMs) and we derive the conditions for a block IFM to be regular. Also a method to find the generalized inverse of it with the help of the generalized inverses of the blocks of the original matrix is described. Again, it is shown that a block intuitionistic fuzzy matrix can be decomposed into an upper triangular idemp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 77 شماره
صفحات -
تاریخ انتشار 2008